Practical Constraint K-Segment Principal Curve Algorithms for Generating Railway GPS Digital Map
نویسندگان
چکیده
منابع مشابه
Constraint K-Segment Principal Curves
To represent the intrinsic regularity of data, one way is to compute the “middle” curves or principal curves (PCs) across the data. However, there are difficulties for current PCs algorithms to discover some known positions that are out of the sampled range of data (Henceforth, out-of-the-samples). Based on principal curves with length constraint proposed by kégl (KPCs), we propose constraint K...
متن کاملgenerating a digital management map using gps for herbicide application by vra spraying
this paper presents a method for generating a digital management map to apply cyanazine pre-emergence herbicide. the main objective was to develop a precision method to generate management maps for the variable rate application of herbicide to reduce the amount of herbicide applied and its adverse impact on the environment. first, local and utm coordinates of a field were determined using total...
متن کاملAlgorithms for 3 D Map Segment Registration
Many applications require dimensionally accurate and detailed maps of the environment. Mobile mapping devices with laser ranging devices can generate highly detailed and dimensionally accurate coordinate data in the form of point clouds. Point clouds represent scenes with numerous discrete coordinate samples obtained about a relative reference frame defined by the location and orientation of th...
متن کاملgenerating a vegetation map in mountainous region of sabzkouh using a digital elevation model
the analysis of the relationship between spatial distribution of environmental factors andvegetation types is crucial for understanding mountainous ecosystems. in this research agis based approach was used to produce a vegetation map for sabzkouh protected area inthe chaharmahal-va-bakhtiari province. to identify environmental parameters affecting thevegetation cover, 6 primary and secondary en...
متن کاملPractical Algorithms for Best-K Identification in Multi-Armed Bandits
In the Best-K identification problem (Best-K-Arm), we are given N stochastic bandit arms with unknown reward distributions. Our goal is to identify the K arms with the largest means with high confidence, by drawing samples from the arms adaptively. This problem is motivated by various practical applications and has attracted considerable attention in the past decade. In this paper, we propose n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2013
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2013/258694